Low-communication SMC protocols from Boolean circuits
نویسندگان
چکیده
This report describes experiments in generating low-communication secure multi-party protocols on arithmetic circuits by providing a translation from a Boolean circuit format. Boolean circuits are typically used for Yao’s garbled circuits protocol, providing a constant-round computation with relatively large communication overhead. BGW-style protocols based on ring or field arithmetic have lower communication, but complex bit-level computations may be difficult and inefficient to represent with arithmetic circuits. We provide a toolchain for generating low-communication BGW-style protocols from Boolean circuits for these kinds of bit-level computations, linking together existing SMC compilers, and present our experiment results with this toolchain.
منابع مشابه
Secure Multi-party Computation Protocols from a High-Level Programming Language
Secure multi-party computation (SMC) enables privacy-preserving computations on data originating from a number of parties. In today’s digital world, data privacy is increasingly more difficult to provide. With SMC methods like secret sharing and Yao’s garbled circuits, it is possible to build privacypreserving computational protocols that do not leak confidential inputs to other parties. The ad...
متن کاملQuantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any problem f : X × Y → Z the multicolor discrepancy of the communication matrix of f is 1/2, then any bounded error quantum protocol with space S, in which Alice receives some l inputs, Bob r inputs, and they compute f(xi, yj) for the...
متن کاملPrivacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
Garbled circuits are of central importance in cryptography, finding widespread application in secure computation, zero-knowledge (ZK) protocols, and verifiable outsourcing of computation to name a few. We are interested in a particular kind of garbling scheme, termed privacy-free in the literature. We show that Boolean formulas can be garbled information-theoretically in the privacyfree setting...
متن کاملCheapSMC: A Framework to Minimize SMC Cost in Cloud
Secure multi-party computation (SMC) techniques are increasingly becoming more efficient and practical thanks to many recent novel improvements. The recent work have shown that different protocols that are implemented using different sharing mechanisms (e.g., boolean, arithmetic sharings, etc.) may have different computational and communication costs. Although there are some works that automati...
متن کاملOPFE: Outsourcing Computation for Private Function Evaluation
Outsourcing secure multiparty computation (SMC) protocols has allowed resource-constrained devices to take advantage of these developing cryptographic primitives with great efficiency. While the existing constructions for outsourced SMC guarantee input and output privacy, they require that all parties know the function being evaluated. Thus, stronger security guarantees are necessary in applica...
متن کامل